A Brief Comparison Of Pollock's Defeasible Reasoning And Ranking Functions
نویسنده
چکیده
Formal epistemology could have a better standing within philosophical epistemology than it actually has. One half is Bayesianism, i.e., probability theory, which is silent, though, on the most basic notion of philosophical epistemology, the notion of belief, replacing it by many degrees of belief. The other half is a divided lot of theories, rather at home in computer science and hardly perspicuous for interested philosophers. Doxastic and epistemic logic as introduced by Hintikka (1962) is a common background to those theories, but an insufficient one as soon as changes of beliefs, inductive and defeasible reasoning and kindred things are at issue. Quite a number of those theories even originate from philosophers. Deplorably, however, they appear to proceed as separate research programs, hardly knowing of each other and rather trying to find allies in computer science. If this is the appearance, why should the epistemologist care to attend to that theoretical diversity? It’s not easy to join forces; after all, there is theoretical disagreement. But then there should at least be a joint market for internal exchange and with the external message that there, and only there, a lot of things are at offer which the epistemologists urgently need.
منابع مشابه
Limitations of Skeptical Default Reasoning
Poole has shown that nonmonotonic logics do not handle the lottery paradox correctly. In this paper we will show that Pollock's the ory of defeasible reasoning fails for the same reason: defeasible reasoning is incompatible with the skeptical notion of derivability.
متن کاملAn appreciation of John Pollock's work on the computational study of argument
John Pollock (1940-2009) was an influential American philosopher who made important contributions to various fields, including epistemology and cognitive science. In the last 25 years of his life he also contributed to the computational study of defeasible reasoning and practical cognition in artificial intelligence. He developed one of the first formal systems for argumentation-based inference...
متن کاملExtending a Temporal Defeasible Argumentation Framework with Possibilistic Weights
Recently, a temporal extension of the argumentation defeasible reasoning system DeLP has been proposed. This system, called t-DeLP, allows to reason defeasibly about changes and persistence over time but does not offer the possibility of ranking defeasible rules according to criteria of preference or certainty (in the sense of belief). In this contribution we extend t-DeLP by allowing to attach...
متن کاملDefeasible Dialectics: A Controversy-Oriented Approach Towards Defeasible Argumentation
Defeasible argumentation is concerned with studying plausible but, at the same time, fallible patterns of reasoning. Because plausible arguments can easily be developed, and not all of them can be in force at the same time, the main thrust of the theory is in deriving sound principles for adjudicating among conflicting lines of argumentation. In this paper, we propose to resolve such conflicts ...
متن کاملDefeasible Reasoning
What philosophers call defeosible reasoning is roughly the same OS nonmonotonic reasoning in Al. Some brief remarks ore mode about the nature of reasoning and the relationship between work in epistemology, Al, and cognitive psychology. This is followed by a general description of human rotionol architecture. This description has the consequence that defeasible reasoning has o more complicoted s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Synthese
دوره 131 شماره
صفحات -
تاریخ انتشار 2002